Browsing by Subject "Message passing"

Now showing items 1-20 of 21

    • Conference Object  

      Analyzing the number of slow reads for semifast atomic read/write register implementations 

      Georgiou, Chryssis; Kentros, Sotirios; Nicolaou, Nicolas C.; Shvartsman, A. A. (2009)
      Developing fast implementations of atomic read/write registers in the message passing model is among the fundamental problems in distributed computing. Typical implementations require two communication round trips for read ...
    • Article  

      Asynchronous gossip 

      Georgiou, Chryssis; Gilbert, S.; Guerraoui, R.; Kowalski, D. R. (2013)
      We study the complexity of gossip in an asynchronous, message-passing fault-prone distributed system. We show that an adaptive adversary can significantly hamper the spreading of a rumor, while an oblivious adversary cannot. ...
    • Article  

      Automated implementation of complex distributed algorithms specified in the IOA language 

      Georgiou, Chryssis; Lynch, N.; Mavrommatis, Panayiotis; Tauber, J. A. (2009)
      IOA is a formal language for describing Input/Output automata that serves both as a formal specification language and as a programming language (Garland et al. in http://theory.lcs.mit.edu/tds/ioa/manual.ps, 2004). The IOA ...
    • Article  

      A comparison study of heuristics for mapping parallel algorithms to message-passing multiprocessors 

      Dikaiakos, Marios D.; Rogers, A.; Steiglitz, K. (1995)
      This paper presents a comparison study of popular clustering and mapping heuristics which are used to map task-flow graphs to message-passing multiprocessors. To this end, we use task-graphs which arc representative of ...
    • Article  

      Coordinated cooperative task computing using crash-prone processors with unreliable multicast 

      Davtyan, S.; De Prisco, R.; Georgiou, Chryssis; Hadjistasi, Theophanis; Schwarzmann, A. A. (2017)
      This paper presents a new message-passing algorithm, called Do-UM, for distributed cooperative task computing in synchronous settings where processors may crash, and where any multicasts (or broadcasts) performed by crashing ...
    • Conference Object  

      Cover-ability: Consistent versioning in asynchronous, fail-prone, message-passing environments 

      Nicolaou, Nicolas C.; Fernández Anta, Antonio; Georgiou, Chryssis (Institute of Electrical and Electronics Engineers Inc., 2016)
      An object type characterizes the domain space and the operations that can be invoked on an object of that type. In this paper we introduce a new property for concurrent objects, we call coverability, that aims to provide ...
    • Article  

      Dynamic adaptive data structures for monitoring data streams 

      Aguilar-Saborit, J.; Trancoso, Pedro; Muntes-Mulero, V.; Larriba-Pey, J. L. (2008)
      The monitoring of data streams is a very important issue in many different areas. Aspects such as accuracy, the speed of response, the use of memory and the adaptability to the changing nature of data may vary in importance ...
    • Article  

      Efficient gossip and robust distributed computation 

      Georgiou, Chryssis; Kowalski, D. R.; Shvartsman, A. A. (2003)
      This paper presents an efficient deterministic gossip algorithm for p synchronous, crash-prone, message-passing processors. The algorithm has time complexity T = O(log2 p) and message complexity M = O(p1+ε), for any ε > ...
    • Article  

      Fault-tolerant semifast implementations of atomic read/write registers 

      Georgiou, Chryssis; Nicolaou, Nicolas C.; Shvartsman, A. A. (2009)
      This paper investigates time-efficient implementations of atomic read-write registers in message-passing systems where the number of readers can be unbounded. In particular we study the case of a single writer, multiple ...
    • Article  

      IWIM semantics via fibred automata 

      Banach, Richard; Arbab, Farhad; Papadopoulos, George Angelos; Glauert, J. R. W. (2002)
      Coordination programming helps to separate concerns in the programming of the coordination activities in complex applications software. It separates the development, verification, maintenance, and reuse of the coordination ...
    • Article  

      Max-product algorithms for the generalized multiple-fault diagnosis problem 

      Le, T.; Hadjicostis, Christoforos N. (2007)
      In this paper, we study the application of the max-product algorithm (MPA) to the generalized multiple-fault diagnosis (GMFD) problem, which consists of components (to be diagnosed) and alarms/connections that can be ...
    • Article  

      Net-console: A web-based development environment for MPI programs 

      Papagapiou, Andreas; Evripidou, Paraskevas; Samaras, George S. (1999)
      In this paper we describe Net-console, a Web-based environment for the development of Message Passing Interface (MPI) programs. Using Net-console the user is able to write, execute, debug and evaluate the performance of ...
    • Article  

      Net-dbx: A web-based debugger of MPI programs over low-bandwidth lines 

      Neophytou, Neophytos; Evripidou, Paraskevas (2001)
      This paper describes Net-dbx, a tool that utilizes Java and other World Wide Web tools for the debugging of MPI programs from anywhere in the Internet. Net-dbx is a source-level interactive debugger with the full power of ...
    • Article  

      On the competitiveness of scheduling dynamically injected tasks on processes prone to crashes and restarts 

      Georgiou, Chryssis; Kowalski, D. R. (2015)
      To identify the tradeoffs between efficiency and fault-tolerance in dynamic cooperative computing, we initiate the study of a task performing problem under dynamic processes' crashes/restarts and task injections. The system ...
    • Conference Object  

      On the complexity of asynchronous gossip 

      Georgiou, Chryssis; Gilbert, S.; Guerraoui, R.; Kowalski, D. R. (2008)
      In this paper, we study the complexity of gossip in an asynchronous, message-passing fault-prone distributed system. In short, we show that an adaptive adversary can significantly hamper the spreading of a rumor, while an ...
    • Article  

      On the efficiency of atomic multi-reader, multi-writer distributed memory 

      Englert, B.; Georgiou, Chryssis; Musiał, Peter M.; Nicolaou, Nicolas C.; Shvartsman, A. A. (2009)
      This paper considers quorum-replicated, multi-writer, multi-reader (MWMR) implementations of survivable atomic registers in a distributed message-passing system with processors prone to failures. Previous implementations ...
    • Article  

      On the robustness of (semi) fast quorum-based implementations of atomic shared memory 

      Georgiou, Chryssis; Nicolaou, Nicolas C.; Shvartsman, A. A. (2008)
      This paper studies a trade-off between fault-tolerance and latency in implementations of atomic read/write objects in message-passing systems. In particular, considering fast or semifast quorum-based implementations, that ...
    • Article  

      Performing dynamically injected tasks on processes prone to crashes and restarts 

      Georgiou, Chryssis; Kowalski, D. R. (2011)
      To identify the tradeoffs between efficiency and fault-tolerance in dynamic cooperative computing, we initiate the study of a task performing problem under dynamic processes' crashes/restarts and task injections. The system ...
    • Article  

      Self-stabilizing reconfiguration 

      Dolev, S.; Georgiou, Chryssis; Marcoullis, Ioannis; Schiller, E. M. (2017)
      Current reconfiguration techniques depend on starting the system in a consistent configuration, in which all participating entities are in a predefined state. Starting from that state, the system must preserve consistency ...
    • Article  

      Self-stabilizing virtual synchrony 

      Dolev, S.; Georgiou, Chryssis; Marcoullis, Ioannis; Schiller, E. M. (2015)
      Virtual synchrony (VS) is an important abstraction that is proven to be extremely useful when implemented over asynchronous, typically large, message-passing distributed systems. Fault tolerant design is critical for the ...